Continuous Speech Recognition Using Modified Stack Decoding Algorithm
نویسنده
چکیده
This paper attempts to recognize a speech sequence with a series of words. We represent words with HMM models and use a modified version of stack decoding method [1][2] as the primary algorithm to recognize words. This type of method allows us to recognize a streaming sequence of speech signal as we receive it. We introduced a heuristic function that works with stack decoding algorithm. We also observed how model parameters affect the performance of the algorithm.
منابع مشابه
A Brief Overview of Decoding Techniques for Large Vocabulary Continuous Speech Recognition
A number of decoding strategies for large vocabulary speech recognition are examined from the viewpoint of their search space representation. Different design solutions are compared with respect to the integration of linguistic and acoustic constraints, as implied by M-gram LMs and cross-word phonetic contexts. This study is articulated along two main axes, namely, the network expansion and the...
متن کاملAdaptive Stack Algorithm in Document Image Decoding
The Stack algorithm, which is a best-first search algorithm widely used in speech recognition, is modified for application to the problem of recognizing machine printed text in the Document Image Decoding (DID) framework. An iterative scheme is described wherein successively more stringent Stack searches are performed, each time using a model of the image that is updated on the basis of what wa...
متن کاملAn overview of decoding techniques for large vocabulary continuous speech recognition
A number of decoding strategies for large vocabulary continuous speech recognition (LVCSR) are examined from the viewpoint of their search space representation. Different design solutions are compared with respect to the integration of linguistic and acoustic constraints, as implied by m-gram language models (LM) and cross-word (CW) phonetic contexts. This study is structured along two main axe...
متن کاملImproving the Multi-stack Decoding Algorithm in a Segment-Based Speech Recognizer
During automatic speech recognition selecting the best hypothesis over a combinatorially huge hypothesis space is a very hard task, so selecting fast and efficient heuristics is a reasonable strategy. In this paper a general purpose heuristic, the multi-stack decoding method, was refined in several ways. For comparison, these improved methods were tested along with the well-known Viterbi beam s...
متن کاملVarious Robust Search Methods in a Hungarian Speech Recognition System
This work focuses on the search aspect of speech recognition. We describe some standard algorithms such as stack decoding, multi-stack decoding, the Viterbi beam search and an A* heuristic, then present improvements on these search methods. Finally we compare the performance of each algorithm, grading them according to their performance. We will show that our improvements can outperform the sta...
متن کامل